Run-time Detection of Communication Deadlocks in Occam 2 Programs
نویسندگان
چکیده
A novel approach to detection of communication deadlocks in occam 2 programs is proposed. The main feature of the approach is to monitor the interprocess communications of a target occam 2 program at runtime and detect communication deadlocks in the program by operating a Process-Wait-For Graph (PWFG) of the program. The PWFG is a formal representation of the synchronization waiting situation in an occam 2 program. In addition to the principle of detecting communication deadlocks in occam 2 programs, some issues on implementation of the monitor are also discussed.
منابع مشابه
A scalable deadlock detection algorithm for UPC collective operations
Unified Parallel C (UPC) is a language used to write parallel programs for shared and distributed memory parallel computers. Deadlock detection in UPC programs requires detecting deadlocks that involve either locks, collective operations, or both. In this paper, a distributed deadlock detection algorithm for UPC programs that uses run-time analysis is presented. The algorithm detects deadlocks ...
متن کاملDeadlock Detection in Basic Models of MPI Synchronization Communication Programs
Deadlock Detection in Basic Models of MPI Synchronization Communication Programs LIAO Ming-xue, FAN Zhi-hua (Institute of Software, the Chinese Academy of Sciences, Beijing 100080, China) Abstract: A model of MPI synchronization communication programs is presented and its three basic simplified models are also defined. A series of theorems and methods for deciding whether deadlocks will occur a...
متن کاملA Ring-Based Occam Multi-Processor Computer
This report describes ROMP: a Ring-based Occam Multi-Processor system, which has been constructed for the purpose of investigating techniques for compiling and executing parallel programs on multi-processor computers. ROMP runs Occam 2 programs. Occam channels are multiplexed onto a token ring which links the processors. Shared memory is used to give a very high potential data transfer rate bet...
متن کاملStatic Detection of Deadlocks in Erlang
We address the problem of detecting two different kinds of possible deadlocks in Erlang programs using static analysis. Our analysis is completely automatic, fast and effective in detecting deadlocks while avoiding most false alarms. We have integrated our analysis in dialyzer, a widely used tool for detecting software defects in Erlang programs, and demonstrate its effectiveness on open-source...
متن کاملTowards a Deadlock Analysis for Erlang Programs
We argue that there is a need for automated veri cation of absence of deadlocks in concurrent programs. We brie y describe how absence of deadlocks can be showed, in general, for a program, how the necessary information can be gathered, and the use of formal methods. We discuss timeouts as a method of run-time deadlock detection, and why they remain necessary in some situations, and we suggest ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007